Symmetry Breaking as a Prelude to Implied Constraints: A Constraint Modelling Pattern
نویسندگان
چکیده
Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutions, then searching for solutions that satisfy the constraints. Experts often augment models with implied constraints and constraints that break symmetries in the model. An emerging pattern in the modelling process, highlighted and demonstrated here, is that some powerful implied constraints can be derived only after symmetry-breaking constraints have been added. Furthermore, the choice between alternative symmetry-breaking constraints is commonly made by considering either the amount of symmetry broken or the strength of pruning obtained in comparison with the overhead of enforcing the constraints. We demonstrate that the choice should also consider the strength of the implied constraints derivable from the symmetry breaking constraints. We also discuss future automation of the selection of symmetry-breaking constraints and the derivation of implied constraints.
منابع مشابه
Automated Symmetry Breaking and Model Selection in Conjure
Constraint modelling is widely recognised as a key bottleneck in applying constraint solving to a problem of interest. The CONJURE automated constraint modelling system addresses this problem by automatically refining constraint models from problem specifications written in the ESSENCE language. ESSENCE provides familiar mathematical concepts like sets, functions and relations nested to any dep...
متن کاملPartner Units Revisited ?
The Partner Units Problem is a challenging combinatorial search problem that has applications in the domains of security and surveillance. In this work we look at problem-specific implied constraints, search strategies and symmetry breaking approaches. We discuss the modelling and solving techniques offered by SAT solvers and answer set programming on the one hand, and constraint solvers on the...
متن کاملNegative Effects of Modeling Techniques on Search Performance
Symmetries occur in many combinatorial problems, and a great deal of research has been done on symmetry breaking techniques for backtrack search. However, few results have been reported on the use of symmetry breaking with local search. On four classes of problem we find that adding symmetry breaking constraints to a model impairs local search performance, in terms of both execution time and se...
متن کاملCGRASS: A System for Transforming Constraint Satisfaction Problems
Experts at modelling constraint satisfaction problems know that carefully-chosen transformations of a model can greatly reduce the amount of effort that is required to solve the problem by systematic search; consequently they invest considerable effort in identifying useful transformations. Such transformations include adding constraints that are implied by other constraints, adding constraints...
متن کاملConstraint-Based Approaches to the Covering Test Problem
Covering arrays have been studied for their applications to drug screening and software and hardware testing. In this paper, we model the problem as a constraint program. Our proposed models exploit non-binary (global) constraints, redundant modelling, channelling constraints, and symmetry breaking constraints. Our initial experiments show that with our best integrated model, we are able to eit...
متن کامل